Finding strongly connected components in distributed graphs
نویسندگان
چکیده
The traditional, serial, algorithm for finding the strongly connected components in a graph is based on depth first search and has complexity which is linear in the size of the graph. Depth first search is difficult to parallelize, which creates a need for a different parallel algorithm for this problem. We describe the implementation of a recently proposed parallel algorithm that finds strongly connected components in distributed graphs, and discuss how it is used in a radiation transport solver.
منابع مشابه
On Finding the Strongly Connected Components in a Directed Graph
We present two improved versions of Tarjan's algorithm for the detection of strongly connected components in a directed graph. Our new algorithms handle sparse graphs and graphs with many trivial components (containing only one node) more economically than Tarjan's original algorithm. As an application we present an eecient transitive closure algorithm.
متن کاملSzeged Dimension and $PI_v$ Dimension of Composite Graphs
Let $G$ be a simple connected graph. In this paper, Szeged dimension and PI$_v$ dimension of graph $G$ are introduced. It is proved that if $G$ is a graph of Szeged dimension $1$ then line graph of $G$ is 2-connected. The dimensions of five composite graphs: sum, corona, composition, disjunction and symmetric difference with strongly regular components is computed. Also explicit formulas of Sze...
متن کاملFinding 2-Edge and 2-Vertex Strongly Connected Components in Quadratic Time
We present faster algorithms for computing the 2-edge and 2-vertex strongly connected components of a directed graph, which are straightforward generalizations of strongly connected components. While in undirected graphs the 2-edge and 2-vertex connected components can be found in linear time, in directed graphs only rather simple O(mn)-time algorithms were known. We use a hierarchical sparsifi...
متن کاملEfficient, Reachability-based, Parallel Algorithms for Finding Strongly Connected Components∗ [Technical Report]
Large, complex graphs are increasingly used to represent unstructured data in scientific applications. Applications such as discrete ordinates methods for radiation transport require these graphs to be directed with all cycles eliminated, where cycles are identified by finding the graph.s strongly connected components (SCCs). Deterministic parallel algorithms identify SCCs in polylogarithmic ti...
متن کاملFast Detection of Connected Components in Large Scale Graphs Using MapReduce
Finding connected components of a graph is a fundamental problem in graph theory which arises in many different applications including data mining and network analysis. By increasing popularity of social networks and information systems, scale of real world graphs have increased to billions of nodes and edges. Thus, finding connected components of large scale graphs turned to be a computational...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- J. Parallel Distrib. Comput.
دوره 65 شماره
صفحات -
تاریخ انتشار 2005